Latent Variable Perceptron Algorithm for Structured Classification
نویسندگان
چکیده
We propose a perceptron-style algorithm for fast discriminative training of structured latent variable model, and analyzed its convergence properties. Our method extends the perceptron algorithm for the learning task with latent dependencies, which may not be captured by traditional models. It relies on Viterbi decoding over latent variables, combined with simple additive updates. Compared to existing probabilistic models of latent variables, our method lowers the training cost significantly yet with comparable or even superior classification accuracy.
منابع مشابه
Structured Prediction with Perceptron: Theory and Algorithms
Structured prediction problem is a special case of machine learning problem where both the inputs and outputs are structures such as sequences, trees, and graphs, rather than plain single labels or values. Many important natural language processing (NLP) problems are structured prediction problems, including Part-Of-Speech tagging, parsing, and machine translation. This survey investigates how ...
متن کاملEfficient Latent Structural Perceptron with Hybrid Trees for Semantic Parsing
Discriminative structured prediction models have been widely used in many natural language processing tasks, but it is challenging to apply the method to semantic parsing. In this paper, by introducing hybrid tree as a latent structure variable to close the gap between the input sentences and output representations, we formulate semantic parsing as a structured prediction problem, based on the ...
متن کاملImproving classification with latent variable models by sequential constraint optimization
In this paper we propose a method to use multiple generative models with latent variables for classi cation tasks. The standard approach to use generative models for classi cation is to train a separate model for each class. A novel data point is then classi ed by the model that attributes the highest probability. The algorithm we propose modi es the parameters of the models to improve the clas...
متن کاملA Practical Perspective on Latent Structured Prediction for Coreference Resolution
Latent structured prediction theory proposes powerful methods such as Latent Structural SVM (LSSVM), which can potentially be very appealing for coreference resolution (CR). In contrast, only small work is available, mainly targeting the latent structured perceptron (LSP). In this paper, we carried out a practical study comparing for the first time online learning with LSSVM. We analyze the int...
متن کاملLearning Stochastic Feedforward Neural Networks
Multilayer perceptrons (MLPs) or neural networks are popular models used for nonlinear regression and classification tasks. As regressors, MLPs model the conditional distribution of the predictor variables Y given the input variables X . However, this predictive distribution is assumed to be unimodal (e.g. Gaussian). For tasks involving structured prediction, the conditional distribution should...
متن کامل